Minimizing Cost of Redundant Sensor-Systems with Non-Monotone and Monotone Search Algorithms
نویسندگان
چکیده
This paper considers distributed multisensor applications, and finds redundant configurations that minimize system weight or cost while insuring system dependability. Given choices among different component types, fulfilling the system’s operational requirements but having different dependability parameters and per item cost, two heuristics, one non-monotone (tabu search) and one monotone (simulated annealing), are used to find configurations that minimize the chosen cost metric. The search is limited to a surface delimiting the solution space region fulfilling system dependability requirements. Experimental results are presented with cost savings of 20% compared with the least expensive system consisting of only one component type. A test case compares results from the two methods with an exhaustive search to verify that the heuristics provide reasonable solutions.
منابع مشابه
On Efficiency of Non-Monotone Adaptive Trust Region and Scaled Trust Region Methods in Solving Nonlinear Systems of Equations
In this paper we run two important methods for solving some well-known problems and make a comparison on their performance and efficiency in solving nonlinear systems of equations. One of these methods is a non-monotone adaptive trust region strategy and another one is a scaled trust region approach. Each of methods showed fast convergence in special problems and slow convergence in other o...
متن کاملEconomical Design of Double Variables Acceptance Sampling With Inspection Errors
The paper presents an economical model for double variable acceptance sampling with inspection errors. Taguchi cost function is used as acceptance cost while quality specification functions are normal with known variance. An optimization model is developed for double variables acceptance sampling scheme at the presence of inspection errors with either constant or monotone value functions. The m...
متن کاملCommon Zero Points of Two Finite Families of Maximal Monotone Operators via Proximal Point Algorithms
In this work, it is presented iterative schemes for achieving to common points of the solutions set of the system of generalized mixed equilibrium problems, solutions set of the variational inequality for an inverse-strongly monotone operator, common fixed points set of two infinite sequences of relatively nonexpansive mappings and common zero points set of two finite sequences of maximal monot...
متن کاملFr{'e}chet and Hausdorff Queries on $x$-Monotone Trajectories
vspace{0.2cm}In this paper, we design a data structure for the following problem. Let $pi$ be an $x$-monotone trajectory with $n$ vertices in the plane and $epsilon >0$. We show how to preprocess $pi$ and $epsilon$ into a data structure such that for any horizontal query segment $Q$ in the plane, one can quickly determine the minimal continuous fraction of $pi$ whose Fr{'e}chet and Hausdo...
متن کاملSome results on $L$-complete lattices
The paper deals with special types of $L$-ordered sets, $L$-fuzzy complete lattices, and fuzzy directed complete posets.First, a theorem for constructing monotone maps is proved, a characterization for monotone maps on an $L$-fuzzy complete lattice is obtained, and it's proved that if $f$ is a monotone map on an $L$-fuzzy complete lattice $(P;e)$, then the least fixpoint of $f$ is meet of a spe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004